DIMACS / DIMATIA 2011 Andy

Thomas Hermann , Andy Hunt , John G . Neuhoff

Comments on "The 1993 DIMACS graph coloring Challenge" and "Energy function-based approaches to graph Coloring"

Since all graphs in the 1993 DIMACS graph coloring challenge are undirected, each edge should be only counted once. However, in some files each edge is counted once, whereas in others each edge is counted twice; so a systematical check on the DIMACS challenge is made to eliminate the inconsistencies. Besides, the experimental results of a previous paper by Blas et al. counted each violated edge...

New Upper Bounds for MaxSat

We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove that MaxSat can be solved in time O(|F | · 1.3972), where |F | is the length of a formula F in conjunctive normal form and K is the number of clauses in F . We also prove the time bounds O(|F | · 1.3995), where k is the maximum number of satisfiable clauses, and O((1.1279) ) for ...

" - Optimal Solutions to Nonlinear 0 - 1 Integer Programs Using theSubgradient

In the context of the 1993-1994 DIMACS special year on Parallel Computing, a two-day work-shop entitled \Parallel Processing of Discrete Optimization Problems" was held on April 28{29.The workshop featured about twenty invited speakers from Europe and North America. Thisreport containts the abstracts of the talks. A DIMACS volume with complete refereed papersfrom the worksho...

Report on DIMACS ∗ Working Group on Data

∗DIMACS was founded as a National Science Foundation Science and Technology Center. It is a joint project of Rutgers University, Princeton University, AT&T Labs-Research, Bell Labs, NEC Laboratories America, and Telcordia Technologies, with affiliated partners Avaya Labs, Georgia Institute of Technology, HP Labs, IBM Research, Microsoft Research, Rensselaer Polytechnic Institute, and Stevens In...